Modeling promoter grammars with evolving hidden Markov models

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling promoter grammars with evolving hidden Markov models

MOTIVATION Describing and modeling biological features of eukaryotic promoters remains an important and challenging problem within computational biology. The promoters of higher eukaryotes in particular display a wide variation in regulatory features, which are difficult to model. Often several factors are involved in the regulation of a set of co-regulated genes. If so, promoters can be modele...

متن کامل

Modeling User Satisfaction with Hidden Markov Models

Models for predicting judgments about the quality of Spoken Dialog Systems have been used as overall evaluation metric or as optimization functions in adaptive systems. We describe a new approach to such models, using Hidden Markov Models (HMMs). The user’s opinion is regarded as a continuous process evolving over time. We present the data collection method and results achieved with the HMM model.

متن کامل

Modeling Chaotic Systems with Hidden Markov Models

The problem of modeling chaotic nonlinear dynamical systems using hidden Markov models is considered. A hidden Markov model for a class of chaotic systems is developed from noise-free observations of the output of that system. A combination of vector quantization and the Baum-Welch algorithm is used for training. The importance of this combined iterative approach is demonstrated. The model is t...

متن کامل

Profile Modeling with Hidden Markov Models Summary

The “fundamental” states N in a Hidden Markov Model are (especially in bioinformatics) usually called match states. Sequences formed with symbols of a finite alphabet E are the observations on which the HMM will be based. Two different stochastic processes operate on the state set: one process moves from one state to another, and the second process controls the emission of symbols of E with pro...

متن کامل

Combining Hidden Markov Models and Stochastic-Context Free Grammars

Currently, gene finding and RNA secondary structure prediction are performed separately. This is only valid if, for any DNA sequence the location of genes and corresponding RNA secondary structure can assumed to be independent. I develop methods that take a hidden Markov model for gene finding and a stochastic context-free grammar for RNA secondary structure prediction and from these, construct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bioinformatics

سال: 2008

ISSN: 1460-2059,1367-4803

DOI: 10.1093/bioinformatics/btn254